منابع مشابه
Positivity of Integrated Random Walks
Take a centered random walk Sn and consider the sequence of its partial sums An := ∑n i=1 Si. Suppose S1 is in the domain of normal attraction of an α-stable law with 1 < α ≤ 2. Assuming that S1 is either right-exponential (that is P(S1 > x|S1 > 0) = e−ax for some a > 0 and all x > 0) or right-continuous (skip free), we prove that P { A1 > 0, . . . , AN > 0 } ∼ CαN 1 2α− 1 2 as N → ∞, where Cα ...
متن کاملExit times for Integrated Random Walks
We consider a centered random walk with finite variance and investigate the asymptotic behaviour of the probability that the area under this walk remains positive up to a large time n. Assuming that the moment of order 2 + δ is finite, we show that the exact asymptotics for this probability are n−1/4. To show these asymptotics we develop a discrete potential theory for integrated random walks.
متن کاملA PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کامل0 Loop - Erased Walks and Total Positivity
We consider matrices whose elements enumerate weights of walks in planar directed weighted graphs (not necessarily acyclic). These matrices are totally nonnegative; more precisely, all their minors are formal power series in edge weights with nonnegative coefficients. A combinatorial explanation of this phenomenon involves loop-erased walks. Applications include total positivity of hitting matr...
متن کاملRandom Walks on Random Graphs
The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs. Given a graphG = (V,E), let dG(v) denote the degree of vertex v for all...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
سال: 2014
ISSN: 0246-0203
DOI: 10.1214/12-aihp487